reciprocal square root造句

• The square root unit executes square root and reciprocal square root instructions.
• This is done by binomial approximation or by taking the first two terms of the Taylor expansion for the reciprocal square root:
• If the initial value is not close to the reciprocal square root, the iterations will diverge away from it rather than converge to it.
• The following are iterative methods for finding the reciprocal square root of " S " which is 1 / \ sqrt { S }.
• Integer arithmetic and bit-shifting can yield an approximation to reciprocal square root ( fast inverse square root ), commonly required in computer graphics ).
• Reciprocal square roots have longer latencies, 30 to 52 cycles for single precision ( 32-bit ) and double precision ( 64-bit ) respectively.
• It is known that in a statistical experiment such as tossing a fair coin and counting the occurrences of heads and tails, the numbers of heads and tails after a great many throws will differ by only a tiny percentage, while after only a few throws outcomes with a significant excess of heads over tails or vice versa are common; if an experiment with a few throws is repeated over and over, the outcomes will fluctuate a lot . ( It can be proven that the relative fluctuations reduce as the reciprocal square root of the number of throws, a result valid for all statistical fluctuations, including shot noise .)